On Properties of Fuzzy Mealy Machines
نویسندگان
چکیده
It has been shown that the problem of equivalent and minimization of fuzzy Mealy machines can be resolved via their algebraic study. However, no attention has paid to study fuzzy Mealy machines topologically. This paper introduces topology on the state set of a fuzzy Mealy machine and study of various kinds of fuzzy Mealy machines viz. cyclic, retrievable, strongly connected, with exchange property and connected through this topology. In addition, various products of fuzzy Mealy machines and their relationship in regards to aforementioned kinds of fuzzy Mealy machines are also studied.
منابع مشابه
Executable Protocol Specification in ESL
Hardware specifications in English are frequently ambiguous and often selfcontradictory. We propose a new logic ESL which facilitates formal specification of hardware protocols. Our logic is closely related to LTL but can express all regular safety properties. We have developed a protocol synthesis methodology which generates Mealy machines from ESL specifications. The Mealy machines can be aut...
متن کاملSimple Finite - Fuzzy - Automaton Model 1
Many fuzzy automaton models have been introduced in the past. Here, we discuss two basic nite fuzzy automaton models, the Mealy and Moore types, for lexical analysis. We show that there is a remarkable di erence between the two types. We consider that the latter is a suitable model for implementing lexical analysers. Various properties of fuzzy regular languages are reviewed and studied. A fuzz...
متن کاملSynthesis of Mealy Machines Using Derivatives
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic computation of the coalgebraic notion of stream function derivative, a generalisation of the Brzozowski derivative of regular expressions. In this paper we complete the construction of Mealy machines from specifications in...
متن کاملMealy Machines are a Better Model of Lexical Analyzers
Abstract—Lexical analyzers partition input characters into tokens. When ambiguities arise during lexical analysis, the longest-match rule is generally adopted to resolve the ambiguities. The longest-match rule causes the look-ahead problem in traditional lexical analyzers, which are based on Moore machines. In Moore machines, output tokens are associated with states of the automata. By contrast...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کامل